package Lesson3;

public class Binnary {
public static int bin(int A[],int b, int find)
{
	
	int l=0;
	int r=A.length - 1;
	
	
	while (l <= r) {
		int s= l+(r-l)/2;
		if(A[s] > find)
			r = s-1;
		else {
			if (find > A[s])
				l = s+1;
			else 
				return s;
		}
	}
	return -1;
}
}

